On adjacency and Laplacian cospectral non-isomorphic signed graphs
نویسندگان
چکیده
Let Γ = (G,σ) be a signed graph, where σ is the sign function on edges of G. In this paper, we use operation partial transpose to obtain non-isomorphic Laplacian cospectral graphs. We will introduce two new operations These establish relationship between adjacency spectrum one graph with another graph. As an application, these utilized construct several pairs Finally, integral
منابع مشابه
Cospectral graphs for both the adjacency and normalized Laplacian matrices
In this note we show how to construct two distinct bipartite graphs which are cospectral for both the adjacency and normalized Laplacian matrices by “unfolding” a base bipartite graph in two different ways.
متن کاملNon-Isomorphic Graphs with Cospectral Symmetric Powers
The symmetric m-th power of a graph is the graph whose vertices are m-subsets of vertices and in which two m-subsets are adjacent if and only if their symmetric difference is an edge of the original graph. It was conjectured that there exists a fixed m such that any two graphs are isomorphic if and only if their m-th symmetric powers are cospectral. In this paper we show that given a positive i...
متن کاملOn net-Laplacian Energy of Signed Graphs
A signed graph is a graph where the edges are assigned either positive ornegative signs. Net degree of a signed graph is the dierence between the number ofpositive and negative edges incident with a vertex. It is said to be net-regular if all itsvertices have the same net-degree. Laplacian energy of a signed graph is defined asε(L(Σ)) =|γ_1-(2m)/n|+...+|γ_n-(2m)/n| where γ_1,...,γ_n are the ei...
متن کاملConstructing cospectral graphs for the normalized Laplacian
We give a method to construct cospectral graphs for the normalized Laplacian by swapping edges between vertices in some special graphs. We also give a method to construct an arbitrarily large family of (non-bipartite) graphs which are mutually cospectral for the normalized Laplacian matrix of a graph. AMS 2010 subject classification: 05C50
متن کاملOn Adjacency Matrices and Descriptors of Signed Cycle Graphs
This paper deals with adjacency matrices of signed cycle graphs and chemical descriptors based on them. The eigenvalues and eigenvectors of the matrices are calculated and their efficacy in classifying different signed cycles is determined. The efficacy of some numerical indices is also examined. Mathematics Subject Classification 2010: Primary 05C22; Secondary 05C50, 05C90
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ars Mathematica Contemporanea
سال: 2023
ISSN: ['1855-3974', '1855-3966']
DOI: https://doi.org/10.26493/1855-3974.2902.f01